Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

Traversal Semantics in Object Graphs

Traversal through object graphs is needed for many programming tasks. We show how this task may be specified declaratively at a high level of abstraction, and we give a simple and intuitive semantics for such specifications. The semantics, while intuitive, requires existential quantification over all object graphs to represent the fact that during traversal we have only local knowledge of the g...

Chaotic dynamics on large networks.

Many systems in nature are governed by a large number of agents that interact nonlinearly through complex feedback loops. When the networks are sufficiently large and interconnected, they typically exhibit self-organization and chaos. This paper examines the prevalence and degree of chaos on large unweighted recurrent networks of ordinary differential equations with sigmoidal nonlinearities and...

Chaotic Dynamics Using Electrical

Universal Traversal Sequences for Expander Graphs

Graph reachability is a key problem in the study of various logarithmic space complexity classes. Its version for directed graphs is logspace complete for NSPACE(logn), and hence if proved to be in DSPACE(logn), the open question DSPACE(logn) = NSPACE(log n) will be settled. Seemingly the problem is easier for undirected graphs. In [1] it was shown to be in RLP (1-sided error, logspace, polynom...

Traversal Graphs: Characterization and Efficient Implementation

Adaptive Programming (AP) provides programmers with a graph abstraction of their OO program’s structure (called a class graph) and encapsulates traversals and computation along traversals as adaptive methods. An adaptive method consists of a selector specification, called a strategy, that selects paths in the class graph, and a behavior definition with advice on nodes that are executed while tr...